The interval inclusion number of a partially ordered set
نویسندگان
چکیده
منابع مشابه
Sampling of Multiple Variables Based on Partially Ordered Set Theory
We introduce a new method for ranked set sampling with multiple criteria. The method relaxes the restriction of selecting just one individual variable from each ranked set. Under the new method for ranking, units are ranked in sets based on linear extensions in partially order set theory with considering all variables simultaneously. Results willbe evaluated by a relatively extensive simulation...
متن کاملPartitions of a Finite Partially Ordered Set
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these notions we will find three equivalent definitions, that will be shown to be equivalent. We start by defining partitions of a poset in terms of fibres of some su...
متن کاملInterval Construction within Partially Ordered Object Versions
Revisions of objects (or files, respectively) have always been managed by using labels attached to the revisions. Yet, typical version managers assume that the revisions are ordered totally or at least in a tree-like order. The ordering of labels reflects the semantical dependencies of revisions of a single object, therefore the labels should be able to represent a revision R inheriting propert...
متن کاملThe Total Weak Discrepancy of a Partially Ordered Set
We define the total weak discrepancy of a poset P as the minimum nonnegative integer k for which there exists a function f : V → Z satisfying (i) if a ≺ b then f(a) + 1 ≤ f(b) and (ii) ∑ |f(a)− f(b)| ≤ k, where the sum is taken over all unordered pairs {a, b} of incomparable elements. If we allow k and f to take real values, we call the minimum k the fractional total weak discrepancy of P . The...
متن کاملThe Redheffer Matrix of a Partially Ordered Set
R. Redheffer described an n×n matrix of 0’s and 1’s the size of whose determinant is connected to the Riemann Hypothesis. We describe the permutations that contribute to its determinant and its permanent in terms of integer factorizations. We generalize the Redheffer matrix to finite posets that have a 0 element and find the analogous results in the more general situation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90014-s